Tests for relation type - equivalence or tolerance - in a finite set of elements
نویسندگان
چکیده
The statistical procedure for determination of the type of relation – equivalence or tolerance – in a finite set of elements, estimated on the basis of pairwise comparisons with random errors, is presented. The procedure consists of two tests based on Chebyshev’s inequality for variance of a random variable; the test statistic is a mixture of some random variables. An example of application of the procedure – determination of relation type in the set of functions expressing profitability of treasury securities sold at auctions in Poland – is presented, too.
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملLESZEK KLUKOWSKI Systems Research Institute, Polish Academy of Sciences TESTS FOR RELATION TYPE – EQUIVALENCE OR TOLERANCE – BASED ON MEDIANS FROM MULTIPLE PAIRWISE COMPARISONS
The statistical procedure for determination of the relation type – equivalence or tolerance – in a finite set on the basis of multiple pairwise comparisons with random errors is presented in the paper. The procedure consists of two tests; it is an extension of the approach presented in [3]. The test statistics is based on a mixture of some random variables and rests on: estimated form of both r...
متن کاملFuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION
In a recent paper, De Baets et al. have characterized the fuzzytolerance and fuzzy equivalence relations that a given strict order relation iscompatible with. In this paper, we generalize this characterization by consideringan arbitrary (crisp) relation instead of a strict order relation, while payingattention to the particular cases of a reflexive or irreflexive relation. The reasoninglargely ...
متن کاملA Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006